Subschemes of the Johnson scheme
نویسندگان
چکیده
منابع مشابه
Intersection matrices and the Johnson scheme
In this paper we introduce a generating function F t sk(v)(z) which is a polynomial in terms of z whose coefficients are some intersection matrices. This provides a uniform framework in which several intersection matrices can be extracted from F t sk(v)(z). Several nice properties of F t sk(v)(z) are derived by applying the operator d/dz and studying the operator zd/dz. In the new framework som...
متن کاملThe Hilbert Scheme Parameterizing Finite Length Subschemes of the Line with Support at the Origin
We introduce symmetrizing operators of the polynomial ring A[x] in the variable x over a ring A. When A is an algebra over a field k these operators are used to characterize the monic polynomials F (x) of degree n in A[x] such that A ⊗k k[x](x)/(F (x)) is a free A–module of rank n. We use the characterization to determine the Hilbert scheme parameterizing subschemes of length n of k[x](x). Intr...
متن کاملOn the Nonexistence of Perfect Codes in the Johnson Scheme
Although it was conjectured by Delsarte in 1973 that no nontrivial perfect codes exist in the Johnson scheme, only very partial results are known. In this paper we considerably reduce the range in which perfect codes in the Johnson scheme can exist; e.g., we show that there are no nontrivial perfect codes in the Johnson graph J(2w qp, w), p prime. We give theorems about the structure of perfect...
متن کاملOn a Pair of Dual Subschemes of the Hamming Scheme Hn(q)
We consider codes in the Hamming association scheme Hn (q) with interesting metric properties. We describe how a uniformly packed linear code C determines a pair of dual subschemes. The existence of this pair of sub schemes is used to establish restrictions on the possible distances between codewords in the dual code C.L. These restrictions also apply to arbitrary codes with degree e + 1 and st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1992
ISSN: 0195-6698
DOI: 10.1016/0195-6698(92)90023-s